Beyond Mixed Logics
نویسندگان
چکیده
In order to define some interesting consequence relations, certain generalizations have been proposed in a many-valued semantic setting that useful for defining what called pure, mixed and ordertheoretic relations. But these are insufficient capture other like intersective relations (a relation cannot be defined as relation, but only the intersection of two relations) or with conjunctive (or, better, “universal”) interpretation multiple conclusions. We propose broader framework cases, many others, set common background allows direct compared analysis. At end work, we illustrate comparisons
منابع مشابه
Beyond Regularity for Presburger Modal Logics
Satisfiability problem for modal logic K with quantifier-free Presburger and regularity constraints (EML) is known to be pspace-complete. In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL). This class of languages behaves nicely, in particular when combined with Propositional Dynamic Logic (PDL). By ext...
متن کاملApproximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modal n-logics. Semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof ...
متن کاملSynchronization of Logics with Mixed Rules :
Several mechanisms for combining logics have appeared in the literature. Synchronization is one of the simplest: the language of the combined logic is the disjoint union of the given languages, but the class of models of the resulting logic is a subset of the cartesian product of the given classes of models (the interaction between the two logics is imposed by constraining the class of pairs of...
متن کاملBeyond associative memories: Logics and variables in connectionist models
This paper demonstrates the role of connectionist (neural network) models in reasoning beyond that of an associative memory. First we show that there is a connection between propositional logics and the weighted-sum computation customarily used in connectionist models. Speci cally, the weighted-sum computation can handle Horn clause logic and Shoham's logic as special cases. Secondly, we show h...
متن کاملTPTP and Beyond: Representation of Quantified Non-Classical Logics
The practical employment of automated deduction systems requires the user to input problem statements in a well-formed string representation. While this presentation is usually fixed by the respective system, the various language dialects of the TPTP library are meanwhile accepted as a de-facto standard for all current automated theorem provers based on classical logics. In the context of reaso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2022
ISSN: ['1425-3305', '2300-9802']
DOI: https://doi.org/10.12775/llp.2022.014